Dynamic Group Signature Scheme using Lattices

Lattice-based cryptography is a field of research that has been very active in the last decade. It offers expressiveness along with asymptotic efficiency and seems to the best of our knowledge to be resistant to quantum computers attacks. Advanced cryptography would then benefit from being designed from lattice assumptions. Along those primitives, there is one that grabs our interest: group signatures; it is namely a protocol that allows an user to sign on behalf of a group while keeping his anonymity. Nowadays all lattice-based group signatures are built on the static model, where the group is fixed at its creation and cannot be changed without rerunning all the setup again (and redistributing the keys). This is why we construct during this internship a dynamic group signature scheme based on lattices that is somewhat efficient (as efficient as the best known algorithms for weaker purpose).